Home > Search Results: keywords:"criss-cross method"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 
Criss-cross method
 Papež, Jan ; Kalčevová, Jana (advisor) ; Šmídová, Milada (referee)
This thesis describes the criss-cross method, which solves the tasks of linear programming and does not need primar or dual feasibility of the basis. At first, the single-phase simplex method, that needs primal feasibility, gets described. After that, we describe the dual simplex method, which needs dual feasibility. The criss-cross method combines both of these methods. All of mentioned methods are explained and demonstrated in several examples.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English